Disparate Vulnerability in Link Inference Attacks against Graph Neural Networks

نویسندگان

چکیده

Graph Neural Networks (GNNs) have been widely used in various graph-based applications. Recent studies shown that GNNs are vulnerable to link-level membership inference attacks (LMIA) which can infer whether a given link was included the training graph of GNN model. While most focus on privacy vulnerability links entire graph, none inspected risk specific subgroups (e.g., between LGBT users). In this paper, we present first study disparity subgroup (DSV) against LMIA. First, with extensive empirical evaluation, demonstrate existence non-negligible DSV under settings models and input graphs. Second, by both statistical causal analysis, identify difference three structural properties as one underlying reasons for DSV. Among properties, density has largest effect Third, inspired design new defense mechanism named FairDefense mitigate while providing protection At high level, at each iteration target model training, randomizes edges probability, aiming reduce gap different mitigation. Our results outperforms existing methods trade-off accuracy. More importantly, it offers better

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vulnerability of Networks Against Critical Link Failures

Networks are known to be prone to link failures. In this paper we set out to investigate how networks of varying connectivity patterns respond to different link failure schemes in terms of connectivity, clustering coefficient and shortest path lengths. We then propose a measure, which we call the vulnerability of a network, for evaluating the extent of the damage these failures can cause. Accep...

متن کامل

Link Prediction Based on Graph Neural Networks

Traditional methods for link prediction can be categorized into three main types: graph structure feature-based, latent feature-based, and explicit feature-based. Graph structure feature methods leverage some handcrafted node proximity scores, e.g., common neighbors, to estimate the likelihood of links. Latent feature methods rely on factorizing networks’ matrix representations to learn an embe...

متن کامل

VULNERABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS: GRAPH THEORY METHOD

The main functional purpose of a water distribution network is to transport water from a source to several domestic and industrial units while at the same time satisfying various requirements on hydraulic response. All the water distribution networks perform two basic operations: firstly the water network needs to deliver adequate amounts of water to meet specific requirements, and secondly the...

متن کامل

Inference in Probabilistic Graphical Models by Graph Neural Networks

A useful computation when acting in a complex environment is to infer the marginal probabilities or most probable states of task-relevant variables. Probabilistic graphical models can efficiently represent the structure of such complex data, but performing these inferences is generally difficult. Message-passing algorithms, such as belief propagation, are a natural way to disseminate evidence a...

متن کامل

Towards Imperceptible and Robust Adversarial Example Attacks against Neural Networks

Machine learning systems based on deep neural networks, being able to produce state-of-the-art results on various perception tasks, have gained mainstream adoption in many applications. However, they are shown to be vulnerable to adversarial example attack, which generates malicious output by adding slight perturbations to the input. Previous adversarial example crafting methods, however, use s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings on Privacy Enhancing Technologies

سال: 2023

ISSN: ['2299-0984']

DOI: https://doi.org/10.56553/popets-2023-0103